One-Dimensional Cutting Stock Problem with Cartesian Coordinate Points
نویسندگان
چکیده
منابع مشابه
An ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملOne-dimensional Cutting Stock Problem with Divisible Items
This paper considers the one-dimensional cutting stock problem with divisible items, which is a new problem in the cutting stock literature. The problem exists in steel industries. In the new problem, each item can be divided into smaller pieces, then they can be recombined again by welding. The objective is to minimize both the trim loss and the number of the welds. We present a mathematical m...
متن کاملan aco algorithm for one-dimensional cutting stock problem
the one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. in this paper a meta-heuristic method based on aco is presented to solve this problem. in this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملSolving an one-dimensional cutting stock problem by simulated annealing and tabu search
A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...
متن کاملChoice of Method for General One-Dimensional Cutting Stock Problem
Problems in operations research are often NP complete and optimal solution for larger problems cannot be obtained, therefore heuristic methods have to be used. The boundary between the size of the problem that can be solved optimally and those where heuristic methods should be used is not always clear. To solve this problem we propose a method based on decision trees. The method can be also use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Systems Science and Applied Mathematics
سال: 2017
ISSN: 2575-5838
DOI: 10.11648/j.ijssam.20170205.14